Obvious Manipulations in Cake-Cutting

Fairness and False-Name Manipulations in Randomized Cake Cutting

Cake cutting has been recognized as a fundamental model in fair division, and several envy-free cake cutting algorithms have been proposed. Recent works from the computer science field proposed novelmechanisms for cake cutting, whose approaches are based on the theory of mechanism design; these mechanisms are strategy-proof, i.e., no agent has any incentive to misrepresent her utility function,...

Cake Cutting ∗

In the 2nd world war, if you’re a collection of Polish mathematicians sitting out the war in Lvov, your thoughts naturally turn to ... cake. Or more precisely, how to cut a cake. This is the beginning of what we now call the problem of “fair division”. Fair division algorithms are examples of what we might now call a mechanism, much like an auction. These are protocols designed to allocate reso...

Externalities in Cake Cutting

The cake cutting problem models the fair division of a heterogeneous good between multiple agents. Previous work assumes that each agent derives value only from its own piece. However, agents may also care about the pieces assigned to other agents; such externalities naturally arise in fair division settings. We extend the classical model to capture externalities, and generalize the classical f...

13 Cake Cutting Algorithms

Imagine a cake that must be divided between a group of gluttonous children. To complicate matters, the cake is heterogeneous: two pieces of cake may differ in terms of their toppings, so the children have different preferences over the pieces (one may weakly prefer a larger proportion of chocolate curls, while another may single-mindedly desire the piece with the cherry). In this chapter we dis...

Cake Cutting Algorithms